Implementation of a Speculative Concurrency Controller
نویسندگان
چکیده
Many scheduling algorithms for databases have been developed in order to improve transaction responsiveness. Some developed algorithms meet special needs of real-time databases. These algorithms however, deal with temporal execution aspects , often disregarding semantics of data usage which could further improve performance. One such algorithm is Speculative Concurrency Control , which uses execution redundancy by forking to improve performance. A simpliied version of this algorithm has been implemented as a concur-rency controller for an object oriented real-time database. This paper describes the experiences with the implementation, explains the reasons for only implementing a subset, and indicates required extensions to implement the complete algorithm. Also provided is a theoretical evaluation of the algorithms performance and scalability.
منابع مشابه
Multi-version Speculative Concurrency Control with Delayed Commit
This paper presents an algorithm which extends the relatively new notion of speculative concurrency control by delaying the commitment of transactions, thus allowing other con icting transactions to continue execution and commit rather than restart. This algorithm propagates uncommitted data to other outstanding transactions thus allowing more speculative schedules to be considered. The algorit...
متن کاملPaclib | a System for Parallel Algebraic Computation on Shared Memory Multiprocessors
This paper gives an overview on the structure and the use of Paclib, a new system for parallel algebraic computation on shared memory computers. Paclib has been developed as a professional tool for the simple design and eecient implementation of parallel algorithms in computer algebra and related areas. It provides concurrency, shared memory communication , non-determinism, speculative parallel...
متن کاملThe Design of the PACLIB Kernel
This paper describes the runtime kernel of paclib, a new system for parallel algebraic computation on shared memory computers. paclib has been developed as a professional tool for the simple design and eecient implementation of parallel algorithms in computer algebra and related areas. It provides concurrency, shared memory communication, non-determinism, speculative parallelism, streams and pi...
متن کاملFoundations of Speculative Distributed Computing
Speculation is frequent in distributed computing. It is even the norm in distributed algorithms that are designed for practical purposes. Yet, speculation is difficult and it has, so far, led to algorithms that are intricate and hard to reason about, let aside prove and test. The reason is simple: speculation involves different execution paths that are usually intermingled in the same algorithm...
متن کاملSpeculative Concurrency Control for Real-Time Databases
In this paper, we propose a new class of Concurrency Control Algorithms that is especially suited for real-time database applications. Our approach relies on the use of (potentially) redundant computations to ensure that serializable schedules are found and executed as early as possible, thus, increasing the chances of a timely commitment of transactions with strict timing constraints. Due to i...
متن کامل